High-Performance Testing: Parallelizing Functional Tests for Computer Systems Using Distributed Graph Exploration

نویسندگان

  • Alexey Demakov
  • Alexander Kamkin
چکیده

Functional testing of complex hardware and software systems has long been recognized as an immensely computerintensive task. Consisting of a huge number of interacting components, computer systems are hard to be verified due to the well-known fundamental problem – combinatorial state explosion. One of the ways to overcome the complexity is to use abstract models for generating test sequences and checking design correctness. However, models of really complex systems are complex themselves, which leads to enormously long test sequences (tests are usually targeted at covering all model states reachable from the initial one). In this paper, we suggest a method for high-performance generation and execution of modelbased tests based on the distributed exploration of a system’s graph model. The key feature of the method is that parallelization is done dynamically and fully transparently for a user. Keywords–functional testing; simulation-based verification; combinatorial state explosion; distributed computing; graph exploration; UniTESK technology

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

Optimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits

There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....

متن کامل

Green Energy-aware task scheduling using the DVFS technique in Cloud Computing

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

Taming the Raven - Testing the Random Access, Visualization and Exploration Network RAVEN

The Random Access, Visualization and Exploration Network (RAVEN) aims to allow for the storage, analysis and visualisation of peta-bytes of scientific data in (near) real-time. In essence, RAVEN is a huge distributed and parallel system. While testing of distributed systems, such as huge telecommunication systems, is well understood and performed systematically, testing of parallel systems, in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011